Constructing Incremental Sequences in Graphs
نویسندگان
چکیده
Given a weighted graph G = (V,E,w), we investigate the problem of constructing a sequence of n = |V | subsets of vertices M1, . . . ,Mn (called groups) with small diameters, where the diameter of a group is calculated using distances in G. The constraint on these n groups is that they must be incremental: M1 ⊂ M2 ⊂ · · · ⊂ Mn = V . The cost of a sequence is the maximum ratio between the diameter of each group Mi and the diameter of a group N i with i vertices and minimum diameter: max2≤i≤n n
منابع مشابه
Constructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملBetter Bounds for Incremental Frequency Allocation in Bipartite Graphs
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain number of requests, and each of those requests must be assigned a different frequency. Edges represent conflicts between cells, meaning that frequencies in adjacent vertices must be different as well. The objective is to...
متن کاملSeismic Design of Steel Structures Based on Ductility and Incremental Nonlinear Dynamic Analysis
In this paper a simple tool for seismic design of steel structures for a selected ductility level is presented. For this purpose, a consistent set of earthquakes is selected and sorted based on the maximum acceleration of ground surface. The selected records are applied as the base motion to a single-degree-of-freedom system with strain hardening and the maximum response acceleration is determi...
متن کاملIncremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming this, we introduce incremental learning, a process in which an inductive programming system automatically modifies its inductive bias towards some domain through solving a sequence of gradually more difficult problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Algorithmic Operations Research
دوره 1 شماره
صفحات -
تاریخ انتشار 2006